منابع مشابه
PLATO: A Generic Modeling Technique for Optical Packet-Switched Networks
This paper presents PLATO, an analytical technique to model the performance in all-optical packet-switched networks with various topologies and node architectures. Using this technique, we propose a two-part algorithm, incorporating mathematical analysis and a numeric method, to model the network’s traffic flow and the local packet-loss probability inside each node. The PLATO technique has demo...
متن کاملDesign of Arrayed Waveguide Grating based Optical Switch for High Speed Optical Networks
This paper demonstrates the design of an Arrayed Waveguide Gratings (AWG) based optical switch. In the design both physical and network layer analysis is performed. The physical layer power and noise analysis is done to obtain Bit Error Rate (BER). This has been found that at the higher bit rates, BER is not affected with number of buffer modules. Network layer analysis is done to obtain perfor...
متن کاملDijkstra Graphs
We revisit a concept that has been central in some early stages of computer science, that of structured programming: a set of rules that an algorithm must follow in order to acquire a structure that is desirable in many aspects. While much has been written about structured programming, an important issue has been left unanswered: given an arbitrary, compiled program, describe an algorithm to de...
متن کاملFormalizing Dijkstra
We present a HOL formalization of the foundational parts of Dijkstra’s classic monograph “A Discipline of Programming”. While embedding programming language semantics in theorem provers is hardly new, this particular undertaking raises several interesting questions, and perhaps makes an interesting supplement to the monograph. Moreover, the failure of HOL’s first order proof tactic to prove one...
متن کاملOptimizing Dijkstra for real-world performance
Using Dijkstra’s algorithm to compute the shortest paths in a graph from a single source node to all other nodes is common practice in industry and academia. Although the original description of the algorithm advises using a Fibonacci Heap as its internal queue, it has been noted that in practice, a binary (or d-ary) heap implementation is significantly faster. This paper introduces an even fas...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optical Communications and Networking
سال: 2019
ISSN: 1943-0620,1943-0639
DOI: 10.1364/jocn.11.000568